Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
نویسندگان
چکیده
We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.
منابع مشابه
Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants
Timed-Arc Petri Nets (TAPN) is a well studied extension of the classical Petri net model where tokens are decorated with real numbers that represent their age. Unlike reachability, which is known to be undecidable for TAPN, boundedness and coverability remain decidable. The model is supported by a recent tool called TAPAAL which, among others, further extends TAPN with invariants on places in o...
متن کاملMinimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
This paper presents the Monotone-Pruning algorithm (MP) for computing the minimal coverability set of Petri nets. The original Karp and Miller algorithm (K&M) unfolds the reachability graph of a Petri net and uses acceleration on branches to ensure termination. The MP algorithm improves the K&M algorithm by adding pruning between branches of the K&M tree. This idea was first introduced in the M...
متن کاملProperties of Distributed Timed-Arc Petri Nets
In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This formalism enables to model e.g. hardware architectures like GALS. We give a formal definition of process semantics for our model and investigate several properties of local versus globa...
متن کاملPriced Timed Petri Nets
We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places, and firing costs to transitions. This general model strictly subsumes both priced timed automata and unbound...
متن کاملTimed Hierarchical Object-Oriented Petri Net
Petri nets (Murata, 1989) (Peterson, 1991) have been widely used to model various discrete event systems (Moody & Antsaklis, 1998). Characterized as concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic (Murata, 1989), Petri nets have gained more and more applications. However, when they are used to analyze and model systems of different domains, the shortages of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009